A Relatively Complete Axiomatisation of Projection onto State in the Duration Calculus

نویسندگان

  • Dimitar P. Guelev
  • Dang Van Hung
چکیده

We present a complete axiomatisation of the operator of projection onto state in the Duration Calculus (DC ) relative to validity in DC without extending constructs. Projection onto state was introduced and studied extensively in our earlier works. We first establish the completeness of a system of axioms and proof rules for the operator relative to validity in the extension of DC by neighbourhood formulas, which express the neighbourhood values of boolean DC state expressions. By establishing a relatively complete axiomatisation for the neighbourhood formulas in DC , we then achieve completeness of our system relative to basic DC .

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Complete Proof System for First-order Interval Temporal Logic with Projection

This paper presents an ω-complete proof system for the extension of first order Interval Temporal Logic (ITL, [12, 15, 4]) by a projection operator [16, 11]. Alternative earlier approaches to the axiomatisation of projection in ITL are briefly presented and discussed. An extension of the proof system which is complete for the extension of Duration Calculus (DC , [24]) by projection is also given.

متن کامل

Completeness of Kozen's Axiomatisation of the Propositional mu-Calculus

Propositional μ-calculus is an extension of the propositional modal logic with the least fixpoint operator. In the paper introducing the logic Kozen posed a question about completeness of the axiomatisation which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete.

متن کامل

A Complete Deductive System for the μ-Calculus

The propositional μ-calculus as introduced by Kozen in [12] is considered. In that paper a finitary axiomatisation of the logic was presented but its completeness remained an open question. Here a different finitary axiomatisation of the logic is proposed and proved to be complete. The two axiomatisations are compared.

متن کامل

A NOTE ON THE COMPLETENESS OF KOZEN’S AXIOMATISATION OF THE PROPOSITIONAL ì-CALCULUS

The propositional ì-calculus is an extension of the modal system K with a least fixpoint operator. Kozen posed a question about completeness of the axiomatisation of the logic which is a small extension of the axiomatisation of the modal system K. It is shown that this axiomatisation is complete. §

متن کامل

A diagrammatic axiomatisation of the GHZ and W quantum states

In the context of categorical quantum mechanics, Coecke and Kissinger suggested that two 3-qubit states, GHZ and W, may be used as the building blocks of a new graphical calculus, aimed at a diagrammatic classification of multipartite qubit entanglement under stochastic local operations and classical communication (SLOCC). We present a full graphical axiomatisation of the relations between GHZ ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Journal of Applied Non-Classical Logics

دوره 14  شماره 

صفحات  -

تاریخ انتشار 2004